<scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times
نویسندگان
چکیده
This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b − 1, and can have at most one job in service 1 jobs the buffer. The time follows Coxian-2 distribution. We focus on steady-state performance policies heavy traffic regime such that normalized system is λ = N−α 0 < α 0.5. identify set achieve asymptotic zero waiting. include several classical as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) power-of-d-choices (Po d) with d O(Nα log N). proof main result based Stein's method state space collapse. A key technical contribution this iterative collapse approach leads to simple generator approximation when applying method.
منابع مشابه
A Load Balancing Policy for Distributed Web Service
The proliferation of web services; and users appeal for high scalability, availability and reliability of web servers to provide rapid response and high throughput for the Clients’ requests occurring at anytime. Distributed Web Servers (DWSs) provide an effective solution for improving the quality of web services. This paper addresses un-regulated jobs/tasks migration among the servers. Conside...
متن کاملLoad Balancing Algorithms in Distributed Service Architectures for Medical Applications
This paper investigates the performance of two proposed load balancing algorithms for Object-Oriented Distributed Service Architectures (DSA) that are open and flexible, enabling rapid and easy development of new applications on various kinds of software and hardware platforms, catering for telecommunications and distributed medical applications. The proposed algorithms, namely, Node Status Alg...
متن کاملDistributed strategic interleaving with load balancing
In a previous paper, we developed an algebraic theory of threads, interleaving of threads, and interaction of threads with services. In the current paper, we assume that the threads and services are distributed over the nodes of a network. We extend the theory developed so far to the distributed case by introducing distributed interleaving strategies that support explicit thread migration and s...
متن کاملA Matrix-Analytic Solution for Randomized Load Balancing Models with PH Service Times
In this paper, we provide a matrix-analytic solution for randomized load balancing models (also known as supermarket models) with phase-type (PH) service times. Generalizing the service times to the phase-type distribution makes analysis of the supermarket models more difficult and challenging than that of the exponential service time case which has been extensively discussed in the literature....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 2021
ISSN: ['1520-6750', '0894-069X']
DOI: https://doi.org/10.1002/nav.21986